3D Realization of Penrose Polygons Using Non-Rectangularity Trick
نویسندگان
چکیده
This paper generalizes an impossible figure called a "Penrose triangle" to regular polygonal figures and proposes method for constructing real 3D objects from such figures. Two well-known tricks, namely the curved surface trick discontinuity trick, have been used construct However, these tricks are very sensitive viewpoint. The proposed uses only planar faces connects them wherever they appear be connected. resulting thus less viewpoint in sense that impression of impossibility does not disappear when slightly changes. Moreover, constructed same symmetry as original figures, preserving their elegance.
منابع مشابه
Digital Watermarking for 3D Polygons using Multiresolution Wavelet Decomposition
Recently, much interest is being taken in methods to protect the copyright of digital data and preventing illegal duplication of it. However, in the area of CAD/CAM and CG, there are no effective ways to protect the copyright of 3D geometric models. As a first step to solve this problem, a new digital watermarking method for 3D polygonal models is introduced in this paper. Watermarking is one o...
متن کاملDelaunay-restricted Optimal Triangulation of 3D Polygons
Triangulation of 3D polygons is a well studied topic of research. Existing methods for finding triangulations that minimize given metrics (e.g., sum of triangle areas or dihedral angles) run in a costly $O(n^4)$ time \cite{Barequet95,Barequet96}, while the triangulations are not guaranteed to be free of intersections. To address these limitations, we restrict our search to the space of triangle...
متن کامل3D Shape Representation: Transforming Polygons into Voxels
We developed a method that transforms a polygonal representation of an object into a voxel representation on a 3D regular grid. By applying scale-space theory we derived expressions for an anti-aliased voxel representation of points, lines, and triangles. The algorithm ‘paints’ the triangles on the voxel grid and ‘fills’ the resulting surface. The method can be applied in 3D (medical) imaging a...
متن کاملFast Convex 3D Polygons Overlap Testing
This paper presents a fast method for computing whether or not two convex polygons in three dimensions intersect. The test relies exclusively on the sign of 4 4 determinants. The source code is available online.
متن کاملAn Algorithm for Triangulating 3D Polygons
OF THE THESIS AN ALGORITHM FOR TRIANGULATING 3D POLYGONS by Ming Zou Master of Science in Computer Science Washington University in St. Louis, December 2013 Research Advisor: Professor Tao Ju In this thesis, we present an algorithm for obtaining a triangulation of multiple, non-planar 3D polygons. The output minimizes additive weights, such as the total triangle areas or the total dihedral angl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geijutsu Kagakkai rombunshi
سال: 2021
ISSN: ['1347-2267']
DOI: https://doi.org/10.3756/artsci.20.269